Numeri al Analysis of Queues with Bat h Arrivals

Analysis of Queues with Bat h Arrivals

The steady state distribution of quasi-birth-death pro esses an be eÆ iently obtained by matrix-geometri (MG) methods. Sin e a number of tele ommuni ation problems are modelled by pro esses with bat h arrivals, the extension of MG methods for these pro esses has pra ti al importan e. This paper presents an extension of MG methods whi h is e e tive for the analysis of quasi-birth-death pro esses...

An iterative method for Queueing Systems with Bat h Arrivals and Bat h Departures

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

A Unified Method to Analyze Overtake Free Queueing Systems

In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L(Q) and the time a customer spends in the system (queue), S(W) under the first-in-first-out (FIFO) discipline are special cases of the H = AG law and lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional aws for both L ...

Output Models of MAP / PH / 1 ( / K )

For non-trivial (open) queueing networks, traÆ -based de omposition often represents the only feasible { and at the same time fast { solution method besides simulation. The network is partitioned into individual nodes whi h are analyzed in isolation with respe t to approximate internal traÆ representations. Sin e the orrelations of network traÆ may have a onsiderable impa t on performan e measu...